Proving Termination Using Recursive Path Orders and SAT Solving
Identifieur interne : 004B95 ( Main/Exploration ); précédent : 004B94; suivant : 004B96Proving Termination Using Recursive Path Orders and SAT Solving
Auteurs : Peter Schneider-Kamp [Allemagne] ; René Thiemann [Allemagne] ; Elena Annov [Israël] ; Michael Codish [Israël] ; Jürgen Giesl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. Our encoding allows us to apply SAT solvers in order to determine whether a given term rewrite system is RPO-terminating. Furthermore, to apply RPO within the dependency pair framework, we combined our novel encoding for RPO with an existing encoding for argument filters. We implemented our contributions in the termination prover AProVE. Our experiments show that due to our encoding, combining termination provers with SAT solvers improves the performance of RPO-implementations by orders of magnitude.
Url:
DOI: 10.1007/978-3-540-74621-8_18
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003A69
- to stream Istex, to step Curation: 003A25
- to stream Istex, to step Checkpoint: 000F80
- to stream Main, to step Merge: 004D29
- to stream Main, to step Curation: 004B95
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Proving Termination Using Recursive Path Orders and SAT Solving</title><author><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name></author><author><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name></author><author><name sortKey="Annov, Elena" sort="Annov, Elena" uniqKey="Annov E" first="Elena" last="Annov">Elena Annov</name></author><author><name sortKey="Codish, Michael" sort="Codish, Michael" uniqKey="Codish M" first="Michael" last="Codish">Michael Codish</name></author><author><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F5633DDA197630E66BCFF7D1D2CBE53B96036F67</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-74621-8_18</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-XFNQ588M-V/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003A69</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003A69</idno><idno type="wicri:Area/Istex/Curation">003A25</idno><idno type="wicri:Area/Istex/Checkpoint">000F80</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F80</idno><idno type="wicri:doubleKey">0302-9743:2007:Schneider Kamp P:proving:termination:using</idno><idno type="wicri:Area/Main/Merge">004D29</idno><idno type="wicri:Area/Main/Curation">004B95</idno><idno type="wicri:Area/Main/Exploration">004B95</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Proving Termination Using Recursive Path Orders and SAT Solving</title><author><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik 2, RWTH Aachen</wicri:regionArea><wicri:noRegion>RWTH Aachen</wicri:noRegion><wicri:noRegion>RWTH Aachen</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik 2, RWTH Aachen</wicri:regionArea><wicri:noRegion>RWTH Aachen</wicri:noRegion><wicri:noRegion>RWTH Aachen</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Annov, Elena" sort="Annov, Elena" uniqKey="Annov E" first="Elena" last="Annov">Elena Annov</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Department of Computer Science, Ben-Gurion University</wicri:regionArea><wicri:noRegion>Ben-Gurion University</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Israël</country></affiliation></author><author><name sortKey="Codish, Michael" sort="Codish, Michael" uniqKey="Codish M" first="Michael" last="Codish">Michael Codish</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Department of Computer Science, Ben-Gurion University</wicri:regionArea><wicri:noRegion>Ben-Gurion University</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Israël</country></affiliation></author><author><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>LuFG Informatik 2, RWTH Aachen</wicri:regionArea><wicri:noRegion>RWTH Aachen</wicri:noRegion><wicri:noRegion>RWTH Aachen</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers permutations of the arguments in the lexicographic comparison. Our encoding allows us to apply SAT solvers in order to determine whether a given term rewrite system is RPO-terminating. Furthermore, to apply RPO within the dependency pair framework, we combined our novel encoding for RPO with an existing encoding for argument filters. We implemented our contributions in the termination prover AProVE. Our experiments show that due to our encoding, combining termination provers with SAT solvers improves the performance of RPO-implementations by orders of magnitude.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Israël</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name></noRegion><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><name sortKey="Giesl, Jurgen" sort="Giesl, Jurgen" uniqKey="Giesl J" first="Jürgen" last="Giesl">Jürgen Giesl</name><name sortKey="Schneider Kamp, Peter" sort="Schneider Kamp, Peter" uniqKey="Schneider Kamp P" first="Peter" last="Schneider-Kamp">Peter Schneider-Kamp</name><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name><name sortKey="Thiemann, Rene" sort="Thiemann, Rene" uniqKey="Thiemann R" first="René" last="Thiemann">René Thiemann</name></country><country name="Israël"><noRegion><name sortKey="Annov, Elena" sort="Annov, Elena" uniqKey="Annov E" first="Elena" last="Annov">Elena Annov</name></noRegion><name sortKey="Annov, Elena" sort="Annov, Elena" uniqKey="Annov E" first="Elena" last="Annov">Elena Annov</name><name sortKey="Codish, Michael" sort="Codish, Michael" uniqKey="Codish M" first="Michael" last="Codish">Michael Codish</name><name sortKey="Codish, Michael" sort="Codish, Michael" uniqKey="Codish M" first="Michael" last="Codish">Michael Codish</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004B95 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004B95 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F5633DDA197630E66BCFF7D1D2CBE53B96036F67
|texte= Proving Termination Using Recursive Path Orders and SAT Solving
}}
| This area was generated with Dilib version V0.6.33. |  |